Hypergraph expanders of all uniformities from Cayley graphs

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Hypergraph expanders from Cayley graphs

We present a simple mechanism, which can be randomised, for constructing sparse 3-uniform hypergraphs with strong expansion properties. These hypergraphs are constructed using Cayley graphs over Z2 and have vertex degree which is polylogarithmic in the number of vertices. Their expansion properties, which are derived from the underlying Cayley graphs, include analogues of vertex and edge expans...

متن کامل

Random Cayley Graphs and Expanders

For every 1 > δ > 0 there exists a c = c(δ) > 0 such that for every group G of order n, and for a set S of c(δ) log n random elements in the group, the expected value of the second largest eigenvalue of the normalized adjacency matrix of the Cayley graph X(G,S) is at most (1−δ). This implies that almost every such a graph is an ε(δ)-expander. For Abelian groups this is essentially tight, and ex...

متن کامل

Cayley graphs containing expanders, after Gromov

We give the sketch of a combinatorial proof of the construction by Gromov of a group whose Cayley graph contains a family of expanders. Combining the methods in [Oll1] and [Oll2], it is possible to give a proof of the construction invented by M. Gromov in [G] that there is an infinite group whose Cayley graph contains (in some quasi-isometric sense) a family of expanders. We only give the main ...

متن کامل

Quantum expanders from any classical Cayley graph expander

We give a simple recipe for translating walks on Cayley graphs of a group G into a quantum operation on any irrep of G. Most properties of the classical walk carry over to the quantum operation: degree becomes the number of Kraus operators, the spectral gap becomes the gap of the quantum operation (viewed as a linear map on density matrices), and the quantum operation is efficient whenever the ...

متن کامل

On the Finite Groups that all Their Semi-Cayley Graphs are Quasi-Abelian

In this paper, we prove that every semi-Cayley graph over a group G is quasi-abelian if and only if G is abelian.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings of the London Mathematical Society

سال: 2020

ISSN: 0024-6115,1460-244X

DOI: 10.1112/plms.12371